A Category of Topological Predomains

نویسندگان

  • Ingo Battenfeld
  • Thomas Streicher
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological predomains and qcb spaces are not closed under sobrification

In (Simpson 2003) A. Simpson introduced the category PreDom of topological predomains as a framework for denotational semantics containing also most classical spaces, namely all countably based T0 spaces. Countably based T0 spaces are isomorphic to subspaces of Pω where the latter is endowed with the Scott topology. A qcb space (as introduced in (Menni and Simpson 2002)) is a T0 space which app...

متن کامل

Computational Effects in Topological Domain Theory

This paper contributes towards establishing the category QCB, of topological quotients of countably based spaces, and its subcategory TP, of topological predomains, as a flexible framework for denotational semantics of programming languages. In particular, we show that both categories have free algebras for arbitrary countable parametrised equational theories, and are thus, following ideas of P...

متن کامل

Compactly generated domain theory

We propose compactly generated monotone convergence spaces as a well-behaved topological generalization of directed-complete partial orders (dcpos). The category of such spaces enjoys the usual properties of categories of “predomains” in denotational semantics. Moreover, such properties are retained if one restricts to spaces with a countable pseudobase in the sense of E. Michael, a fact that p...

متن کامل

Quotients of countably based spaces are not closed under sobrification

In this note we show that quotients of countably based spaces (qcb spaces) and topological predomains as introduced by M. Schröder and A. Simpson are not closed under sobrification. As a consequence replete topological predomains need not be sober, i.e. in general repletion is not given by sobrification. Our counterexample also shows that a certain tentative “equalizer construction” of repletio...

متن کامل

Naïve Synthetic Domain Theory A Logical Approach

We present two diierent approaches to Synthetic Domains. First we give a synthetic, axiomatic version of extensional PERs which Freyd et al. 92] introduced model theoretically. Second we rephrase the theory of replete objects (cf. Hyland 91], Taylor 91]). If the category of predomains is small and internally complete two logical characterizations of repletion are possible. Closure properties of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008